lpaiu study
Search
CTRL + K
lpaiu study
Search
CTRL + K
== Study
Algorithm
Algorithm INTRO.
Back Tracking.
Basic Combinatorics
Brute Force
Bubble Sort
Dijkstra Algorithm
Divide and Conquer.
Dynamic Programming.
Encryption Algorithm.
Greedy Algorithm.
Heap Sort
Insertion Sort
Kruskal Algorithm
Machine Learning Algorithm.
Merge Sort.
P-NP 문제
Paradaigm.
Prim Algorithm
Probabilistic Algorithm.
Quick Sort.
Radix Sort
Search
Selection Sort
Sort
Topology Algorithm.
Artificial Intelligence(cs188)
00 AI INTRO.
01 Rational Agent
02 Agent Program
Informed Search Strategies
Solving Problems by Searching
Uninformed Search Strategies
Computer Network
Computer Network INTRO.
Delay, Loss, Throughput.
L2-DataLink Layer.
L3-Network Layer.
L4-Transport Layer.
L5-Application Layer.
LAN
Physical Media.
Queueing
Security
Switching.
Wireless and Mobile Networks.
cs224n(COSE461)
01 Word Vectors
02 GloVe
03
cs231n
01 Image Classification
Data Processing and Analysis
Clustering
Data Processing and Analysis INTRO.
Probabilistic Language Model
Text Analysis
Text Classification
Text Preprocessing
Vector Semantics
Data Structure
Abstract Data Type
Array
AVL Tree
B-Tree
Binary Search Tree
Binary Tree
Complete Binary Tree
Data Structure Implementation
Data Structure INTRO.
Graph
Hash Table
Heap
Linked List
Priority Queue
Queue
Red-Black Tree
Stack
Deep Learning
np-broadcasting, dot, matmul
Linear Algebra
01 Linear system and ERO
02 Existence and Uniqueness Questions
Logic Design
Counter
Flip-Flop
Latch
Mealy and Moore models
Memory and Programmable Logic
Multiplexer MUX
Registers
Sequential Logic
State Table and Diagram
Three-state gate
Operating System
01 Operating System Intro
02 OS structure
03 Event handling mechanisms
04 CPU Scheduling
05 Memory
P1 System Call 함수 정의하기
Python
23-2 Algorithm Challenge Report
class
library and module.
numpy
파이썬의 모든 것은 객체다
System Programming
01 IO Systems
02 File System
03 File and Directory in Disks
04 In-kernel File System Implementation
About Human Thought
의식은 어디에서 시작되었을까
인간의 휴리스틱
Hobby
Chess
더치디펜스
(Ductch) e6 약점
왜 블런더인가?
그릭기프트의 아이디어
막을 수 없는 배터리 어택
성급한 체크는 오히려 압박을 해소할 수 있다.
Insight
Random Walk
생각보다 인류는 빠르게 발전했다.
전문가와 비전문가의 차이
착시 - 해석의 다양성과 불확실성
Introduction
Priority Queue
Priorty Queue
대기열의 데이터들을 우선순위대로 계속 정렬한다.
이는 Heap을 통해 효과적으로 구현 가능하다.
일반 Queue와의 차이점:
들어온 순서와 무관
하게 우선순위가 높은 원소부터 pop.
Heap
Queue